/*
 * @lc app=leetcode.cn id=392 lang=javascript
 *
 * [392] 判断子序列
 */

// @lc code=start
/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isSubsequence = function(s, t) {
    let pointer = 0
    for (let index1 = 0; index1 < t.length; index1++) {
        const e1 = t[index1];
        if (s[pointer] === e1) {
            pointer++
        }
    }
    return s.length === pointer
};
// @lc code=end

